Masta: An HE-Friendly Cipher Using Modular Arithmetic
نویسندگان
چکیده
منابع مشابه
A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix
In this paper, we have developed a block cipher for blocks of size 196 bits and 392 bits. In this, we have represented the plaintext in the form of a matrix of size 28 x 7, consisting of binary bits. The key matrix is represented in the form of a matrix of size 28 x 28, and it comprises binary bits. In the process of decryption, we have used the modular arithmetic inverse (K) of the key matrix ...
متن کاملAn Unassailable Block Cipher Generation with an Extended PCC, Concerning a Large Alphanumeric Kay, Modular Arithmetic and Integral Functions
In this investigation, we have developed an unbreakable block cipher with extended play color cipher algorithm. This includes multiple transpositions, substitutions, modular arithmetic, integral functions and a 32 characters alphanumeric key. These functions mutate the plain text in various ways before it takes the shape of cipher text. The process of encryption, decryption and the sub key gene...
متن کاملModular arithmetic
Since congruence modulo m is an equivalence relation, it partitions the universe of integers into equivalence classes, which we’ll call congruence classes modulo m. Within any one of these classes, all of the members are congruent to all of the other members; but congruence modulo m never holds between members of different equivalence classes. For instance, there are two congruence classes modu...
متن کاملModular Arithmetic Using Low Order Redundant Bases
N-digit, radix-a bases are proposed for VLSI implementation of redundant arithmetic, mod m, where a m = ±1, a j m π ±1, for 0 < j < N and m is prime. These bases simplify arithmetic overflow and are well suited to redundant arithmetic. The representations provide competitive, multiplierless T-point Number Theoretic Transforms, mod m, where T | N or T | 2N.
متن کاملA Modern Hill Cipher Involving a Permuted Key and Modular Arithmetic Addition Operation
In this paper, we have developed a symmetric block cipher by modifying the classical Hill cipher. In this we have made use of iteration process, and introduced a key K0 obtained by permuting the elements of the original key matrix K. This key K0 strengthens the cipher, and it does not allow the cipher to be broken by the known plaintext attack. The avalanche effect and the cryptanalysis clearly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3033564